Decidability of some problems related to the class of nondeterministic iterative (k,m)-systemsGRODZKI, Z.Bulletin of the Polish Academy of Sciences. Technical sciences. 1991, Vol 39, Num 1, pp 145-150, issn 0239-7528Article

The nondeterministic controlled iterative (k,m)-systemsGRODZKI, Z.Bulletin of the Polish Academy of Sciences. Technical sciences. 1991, Vol 39, Num 1, pp 139-144, issn 0239-7528Article

Fair termination revisited-with delayAPT, K. R; PNUELI, A; STAVI, J et al.Theoretical computer science. 1984, Vol 33, Num 1, pp 65-84, issn 0304-3975Article

Langages persistants = Persistent languagesALAIWAN, H.R.A.I.R.O. Informatique théorique. 1984, Vol 18, Num 3, pp 259-278, issn 0399-0540Article

Two most nondeterministic programsWILTINK, J. G; REM, M.Science of computer programming. 1986, Vol 6, Num 1, pp 89-94, issn 0167-6423Article

Systèmes PARallèles Communicants. Etude du non-déterminisme : comparaison des comportements des processus = Parallel communicating systems. Study of non-determinary: comparison of processes behaviorsROGE, Sylvie.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 541. 1985, 76 p.Report

Non deterministic machines and their generalizationsBERTONI, A; MAURI, G; SABADINI, N et al.Lecture notes in physics. 1983, Num 196, pp 86-97, issn 0075-8450Article

A callgraph-based search strategy for automated Performance diagnosis¹CAIN, H. W; MILLER, B. P; WYLIE, B. J. N et al.Lecture notes in computer science. 2000, pp 108-122, issn 0302-9743, isbn 3-540-67956-1Conference Paper

Two implementation relations and the correctness of communicating replicated processesKOUTNY, M; MANCINI, L. V; PAPPALARDO, G et al.Formal aspects of computing. 1997, Vol 9, Num 2, pp 119-148, issn 0934-5043Article

Nondeterministic polling systemsSRINIVASAN, M. M.Management science. 1991, Vol 37, Num 6, pp 667-681, issn 0025-1909Article

On varieties of density and crossing properties for event structuresKOSTOV, V. E; STARKOVA, S. A; VIRBITSKAITE, I. B et al.Computers and artificial intelligence. 1995, Vol 14, Num 6, pp 611-622, issn 0232-0274Article

Unwinding possibilistic security propertiesMANTEL, Heiko.Lecture notes in computer science. 2000, pp 238-254, issn 0302-9743, isbn 3-540-41031-7Conference Paper

On the semantics of concurrency : partial orders and transition systemsBOUDOL, Gérard; CASTELLANI, Ilaria.Rapport de recherche I.N.R.I.A, ISSN: 0249-6399 ; 550. 1986, 17 p.Report

An algorithm for ensuring fairness and liveness in non-deterministic systems based on multiparty interactionsRUIZ, David; CORCHUELO, Rafael; PEREZ, José A et al.Lecture notes in computer science. 2002, pp 563-572, issn 0302-9743, isbn 3-540-44049-6, 10 p.Conference Paper

On the structure of one-tape nondeterministic turing machine time hierarchyKOBAYASHI, K.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 175-193, issn 0304-3975Article

Canonical prefixes of Petri net unfoldingsKHOMENKO, Victor; KOUTNY, Maciej; VOGLER, Walter et al.Lecture notes in computer science. 2002, pp 582-595, issn 0302-9743, isbn 3-540-43997-8, 14 p.Conference Paper

Choice construct and lindström logicsHOANG, H. K.Lecture notes in computer science. 1999, pp 105-125, issn 0302-9743, isbn 3-540-65922-6Conference Paper

Some observations on the connection between counting and recursionWAGNER, K. W.Theoretical computer science. 1986, Vol 47, Num 2, pp 131-147, issn 0304-3975Article

THE APPARENT CONFLICT BETWEEN ESTIMATION AND CONTROL - A SURVEY OF THE TWO-ARMED BANDIT PROBLEM.WITTEN IH.1976; J. FRANKLIN INST.; U.S.A.; DA. 1976; VOL. 301; NO 1-2; PP. 161-189; BIBL. 1 P. 1/2Article

Enumeration reducibility with polynomial time boundsHARRIS, Charles M.Lecture notes in computer science. 2006, pp 209-220, issn 0302-9743, isbn 3-540-35466-2, 1Vol, 12 p.Conference Paper

Non-deterministic semantics for paraconsistent C-systemsAVRON, Arnon.Lecture notes in computer science. 2005, pp 625-637, issn 0302-9743, isbn 3-540-27326-3, 13 p.Conference Paper

Nondeterministic dynamics and turbulent transportKUPIAINEN, A.Annales Henri Poincaré. 2003, Vol 4, pp S713-S726, issn 1424-0637, SUP2Article

A transformation technique for datalog programs based on non-deterministic constructsPOTIKAS, Petros; RONDOGIANNIS, Panos; GERGATSOULIS, Manolis et al.Lecture notes in computer science. 2002, pp 25-45, issn 0302-9743, isbn 3-540-43915-3, 21 p.Conference Paper

Finding the shortest path in the shortest time using PCNN's : Special issue on pulse coupled neural networksCAULFIELD, H. J; KINSER, J. M.IEEE transactions on neural networks. 1999, Vol 10, Num 3, pp 604-606, issn 1045-9227Article

Desiderata in agent architectures for coordinating-multi-agent systemsLEE, J.Lecture notes in computer science. 1999, pp 47-60, issn 0302-9743, isbn 3-540-65967-6Conference Paper